Low-degree minimal spanning trees in normed spaces
نویسندگان
چکیده
We give a complete proof that in any finite-dimensional normed linear space a finite set of points has a minimal spanning tree in which the maximum degree is bounded above by the strict Hadwiger number of the unit ball, i.e., the largest number of unit vectors such that the distance between any two is larger than 1.
منابع مشابه
The Local Steiner Problem in Finite-Dimensional Normed Spaces
We develop a general method of proving that certain star configurations in finite-dimensional normed spaces are Steiner minimal trees. This method generalizes the results of Lawlor and Morgan (1994) that could only be applied to differentiable norms. The generalization uses the subdifferential calculus from convex analysis. We apply this method to two special norms. The first norm, occurring in...
متن کاملRelay Placement for Two-Connectivity
Motivated by applications to wireless sensor networks, we study the following problem. We are given a set S of wireless sensor nodes, given as a multiset of points in a normed space. We must place a minimum-size (multi)set Q of wireless relay nodes in the normed space such that the unit-disk graph induced by Q ∪ S is two-connected. The unit-disk graph of a set of points has an edge between two ...
متن کاملVertex Degrees of Steiner Minimal Trees in lpd and Other Smooth Minkowski Spaces
We find upper bounds for the degrees of vertices and Steiner points in Steiner Minimal Trees in the d-dimensional Banach spaces ldp independent of d. This is in contrast to Minimal Spanning Trees, where the maximum degree of vertices grows exponentially in d (Robins and Salowe, 1995). Our upper bounds follow from characterizations of singularities of SMT’s due to Lawlor and Morgan (1994), which...
متن کاملQuantitative Illumination of Convex Bodies and Vertex Degrees of Geometric Steiner Minimal Trees
In this note we prove two results on the quantitative illumination parameter f (d) of the unit ball of a d-dimensional normed space introduced by K. Bezdek (1992). The first is that f (d) = O(2dd2 log d). The second involves Steiner minimal trees. Let v(d) be the maximum degree of a vertex, and s(d) of a Steiner point, in a Steiner minimal tree in a d-dimensional normed space, where both maxima...
متن کاملOn the Number of Leaves of a Euclidean Minimal Spanning Tree
Let Vk,n be the number of vertices of degree k in the Euclidean minimal spanning tree of Xi, 1 < i n, where the Xi are independent, absolutely continuous random variables with values in Rd. It is proved that n -Vkn converges with probability 1 to a constant ak,dIntermediate results provide information about how the vertex degrees of a minimal spanning tree change as points are added or deleted,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Appl. Math. Lett.
دوره 19 شماره
صفحات -
تاریخ انتشار 2006